Generating Hard Satissability Problems ?
نویسنده
چکیده
We report results from large-scale experiments in satissability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satissability testing is quite diicult. Our results provide a benchmark for the evaluation of satissability-testing procedures.
منابع مشابه
Finding Hard Instances of the Satisfiability Problem
Finding sets of hard instances of propositional satissability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the ...
متن کاملThe Satis ability Constraint
We describe an experimental investigation of the satissability phase transition for several diierent classes of randomly generated problems. We show that the \conventional" picture of easy-hard-easy problem diiculty is inadequate. In particular, there is a region of very variable problem dii-culty where problems are typically underconstrained and satissable. Within this region, problems can be ...
متن کاملA NN Algorithm for Boolean Satis ability Problems
Satissability (SAT) refers to the task of nding a truth assignment that makes an arbitrary boolean expression true. This paper compares a neural network algorithm (NNSAT) with GSAT 4], a greedy algorithm for solving satissability problems. GSAT can solve problem instances that are diicult for traditional satissability algorithms. Results suggest that NNSAT scales better as the number of variabl...
متن کاملHard and Easy Distributions of SAT Problems
We report results from large-scale experiments in satis-ability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satissability testing is quite diicult....
متن کاملFuzzy Satissability
This paper deenes a problem that we called \fuzzy satissability" or \-satissability." It describes in mathematical terms the semantics of satisfying clauses and formulas using fuzzy logic, by converting a boolean formula into an arithmetic expression via t-norm and t-conorm operators. It is shown that for any (t-norm, t-conorm) pair, the corresponding-satissability problem is NP-hard when the v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995